منابع مشابه
From Passive Dynamic Walking to Passive Turning of Biped walker
Dynamically stable biped robots mimicking human locomotion have received significant attention over the last few decades. Formerly, the existence of stable periodic gaits for straight walking of passive biped walkers was well known and investigated as the notion of passive dynamic walking. This study is aimed to elaborate this notion in the case of three dimensional (3D) walking and extend it f...
متن کاملfrom passive dynamic walking to passive turning of biped walker
dynamically stable biped robots mimicking human locomotion have received significant attention over the last few decades. formerly, the existence of stable periodic gaits for straight walking of passive biped walkers was well known and investigated as the notion of passive dynamic walking. this study is aimed to elaborate this notion in the case of three dimensional (3d) walking and extend it f...
متن کاملFrom Passive to Active Forms
Based on the continuous increase in functionality of interactive products, tangible user interfaces are coming up. We will address one important design challenge: how to design the feedback of the internal state of the interactive product in a natural way. Although already several solutions are possible, we will introduce a new approach via smart materials. With smart materials the feedback of ...
متن کاملFrom Passive to Active Voice:
Researchers often find themselves in a position of “acting for” or “in the name of” individuals and communities whose voices have traditionally been muted or silenced. The passive nature of these muted or silenced voices prevents them from being heard, fully understood or appreciated. As true voices of participants emerge in research, so does a more representative view of individuals’ or commun...
متن کاملList Homomorphisms to Reflexive Digraphs
We study list homomorphism problems L-HOM(H) for the class of reflexive digraphs H (digraphs in which each vertex has a loop). These problems have been intensively studied in the case of undirected graphs H, and appear to be more difficult for digraphs. However, it is known that each problem L-HOM(H) is NP-complete or polynomial time solvable. In this paper we focus on reflexive digraphs. We in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kansas Working Papers in Linguistics
سال: 1998
ISSN: 1043-3805
DOI: 10.17161/kwpl.1808.345